Decision Value Oriented Decomposition of Data Tables
نویسنده
چکیده
The framework for decision value oriented decomposition of data tables is stated with examples of its applications to partially generalized reasoning. Operation of synthesis of information is introduced for distributed decision tables. Theoretical foundations are built on the basis of the main factors of quality of reasoning, by referring to rough set, Dempster-Shafer and statistical theories.
منابع مشابه
Ranking Efficient Decision Making Units Using Cooperative Game Theory Based on SBM Input-Oriented Model and Nucleolus Value
In evaluating the efficiency of decision making units (DMUs) by Data Envelopment Analysis (DEA) models, may be more than one DMU has an efficiency score equal to one. Since ranking of efficient DMUs is essential for decision makers, therefore, methods and models for this purpose are presented. One of ranking methods of efficient DMUs is cooperative game theory. In this study, Lee and Lozano mod...
متن کاملA new non oriented models for calculating the efficiency of decision-making units in the presence of flexible variables
In assessing the relative efficiency of decision-maker units by classical Data Envelopment Analysis (DEA) models, the status of the data is determined from the input or output points of views. In real issues, there are some data whose statuses are debatable. Some decision making units consider them as input to achieve higher efficiency while some other decision making units consider them ...
متن کاملExperimental evaluation of three partition
Decision table decomposition is a machine learning approach that decomposes a given decision table into an equivalent hierarchy of decision tables. The approach aims to discover decision tables that are overall less complex than the initial one, potentially easier to interpret, and introduce new and meaningful intermediate concepts. Since an exhaustive search for an optimal hierarchy of decisio...
متن کاملEvaluation of Decision Table Decomposition Using Dynamic Programming Classifiers
Decision table decomposition is a method that decomposes given decision table into an equivalent set of decision tables. Decomposition can enhance the quality of knowledge discovered from databases by simplifying the data mining task. The paper contains a description of decision table decomposition method and their evaluation for data classification. Additionally, a novel method of obtaining at...
متن کاملAccelerated decomposition techniques for large discounted Markov decision processes
Many hierarchical techniques to solve large Markov decision processes (MDPs) are based on the partition of the state space into strongly connected components (SCCs) that can be classified into some levels. In each level, smaller problems named restricted MDPs are solved, and then these partial solutions are combined to obtain the global solution. In this paper, we first propose a novel algorith...
متن کامل